An Analysis of Linear Prices in Iterative Combinatorial Auctions

نویسندگان

  • Pavlo Shabalin
  • Alexander Pikovsky
  • Martin Bichler
چکیده

Ask prices are the most essential form of information feedback in Iterative Combinatorial Auctions (ICA) and vital in achieving an efficient auction outcome. Different pricing concepts have been analyzed in the literature, including linear, non-linear and discriminative non-linear prices. Linear prices, i.e. per-item prices, are intuitive and easy to understand for bidders, however, under certain conditions they can hinder auction efficiency. In this paper we analyze ways how approximate linear prices are calculated, identify problems of existing approaches and suggest alternative rules for calculating linear prices and stopping the auction. We use computer simulations as a tool to benchmark different auction designs, and compare their results based on allocative efficiency. Keyword: combinatorial auction, efficiency, linear prices, discrete event simulation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats

Iterative combinatorial auctions (ICAs) are IT-based economic mechanisms where bidders submit bundle bids in a sequence and an auctioneer computes allocations and ask prices in each auction round. The literature in this field provides equilibrium analysis for ICAs with non-linear personalized prices under strong assumptions on bidders’ strategies. Linear pricing has performed very well in the l...

متن کامل

On the Computational Power of Iterative Auctions I: Demand Queries

We study the computational power and limitations of iterative combinatorial auctions. Most existing iterative combinatorial auctions are based on repeatedly suggesting prices for bundles of items, and querying the bidders for their “demand” under these prices. We prove several results regarding such auctions that use a polynomial number of demand queries: (1) that such auctions can simulate sev...

متن کامل

On the Computational Power of Demand Queries

We study the computational power of iterative combinatorial auctions. Most existing iterative combinatorial auctions are based on repeatedly suggesting prices for bundles of items, and querying the bidders for their “demand” under these prices. We prove several results regarding such auctions that use a polynomial number of demand queries: (1) that such auctions can simulate several other natur...

متن کامل

An Experimental Comparison of Combinatorial Procurement Auctions

The need for new procurement auction mechanisms that allow for rich bid types such as bundle bids on multiple items has been raised in many situations in industrial procurement. In addition to strategic problems, the design of these combinatorial auctions exhibits hard computational problems. For example, the winner determination typically leads to NP-hard allocation problems in combinatorial a...

متن کامل

Information Feedback in Iterative Combinatorial Auctions

Auctions have been getting increasing attention in computer science and economics, as they provide an efficient solution to resource allocation problems with self-interested agents. E-Commerce and finance have emerged as some of their largest application fields. The need for new auction mechanisms that allow complex bids such as bundle or multi-attribute bids has been raised in many situations....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006